Automata on the plane vs particles and collisions
نویسندگان
چکیده
In this note, colorings of the plane by finite sequential machines are compared to previously introduced notions of ultimately periodic tilings of the plane. Finite automata with no counter characterize exactly biperiodic tilings. Finite automata with one counter characterize exactly particles — periodic colorings that are ultimately periodic in every direction. Finite automata with two counters and aperiodic colorings characterize exactly collisions — ultimately periodic tilings of the plane.
منابع مشابه
A Language for Particle Interactions in Rule 54 and Other Cellular Automata
This is a study of localized structures in one-dimensional cellular automata, with the elementary cellular automaton rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all one-dimensional cellular automata. We can compute which particles collide and in how many ways. We can also compute the fate of a particle after an unlimited number of c...
متن کاملCollisions and their Catenations: Ultimately Periodic Tilings of the Plane
Motivated by the study of cellular automata algorithmic and dynamics, we investigate an extension of ultimately periodic words to twodimensional infinite words: collisions. A natural composition operation on tilings leads to a catenation operation on collisions. By existence of aperiodic tile sets, ultimately periodic tilings of the plane cannot generate all possible tilings but exhibit some us...
متن کاملModeling Urban Sprawling of Tehran Metropolitan Area Based on PSO
The main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on TM and ETM+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. In this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...
متن کاملParity Filter Automata
Parity filter automata are a class of two-st a te cellular aut omata on the intege r grid po ints of t he real line in which cells are updated serially from left to right in each time period ra.ther than 5YOchronously in parallel. Parity filter auto mata support large numbers of "par ticles," or persistent repeating configurations, and the collision of these particles is frequently a. "soliton"...
متن کاملParticle in Cell-Monte Carlo Collisions of a Plasma Column Driven by Surface Wave Plasma Discharges
In this work, applicability of Particle in Cell-Monte Carlo Collisions (PIC-MCC) simulation method for better understanding of the plasma physical mechanisms and real important aspects of a plasma column driven by surface wave plasma discharges that is used in plasma antennas is examined. Via the implementation of geometry and physical parameters of the plasma column to an Object Oriented PIC-M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009